Isomorphic Representations and Well-Formedness of Engineering Systems

compactifications and representations of transformation semigroups

this thesis deals essentially (but not from all aspects) with the extension of the notion of semigroup compactification and the construction of a general theory of semitopological nonaffine (affine) transformation semigroup compactifications. it determines those compactification which are universal with respect to some algebric or topological properties. as an application of the theory, it is i...

Proving well-formedness of interface specifications

Automated software verification systems, that try to prove the correctness of a program, use specifications in the code as a base to verify said program. When this specification includes calls to sideeffect free methods, the verification system might want to use the specification of these side-effect free methods to have more information available for its correctness proofs. Unfortunately, the ...

Speech perception, well-formedness, and lexical frequency

The lexical bases of morphological well-formedness

1. Introduction Not all words, real or novel, are created equal — some sound better than others, either for phonological or for morphological reasons. That is, well-formedness is a gradient notion. One simple way to measure gradient well-formedness is through acceptability ratings. For example, native English speakers generally agree that there are several conceivable past tenses for the made-u...

Checking Well-Formedness of Pure-Method Specifications

Contract languages such as JML and Spec# specify invariants and preand postconditions using side-effect free expressions of the programming language, in particular, pure methods. For such contracts to be meaningful, they must be well-formed: First, they must respect the partiality of operations, for instance, the preconditions of pure methods used in the contract. Second, they must enable a con...